The mixing-MIR set with divisible capacities
نویسندگان
چکیده
منابع مشابه
The mixing-MIR set with divisible capacities
We study the set S = {(x, y) ∈ + × Zn : x + Bjyj ≥ bj, j = 1, . . . , n}, where Bj , bj ∈ +−{0}, j = 1, . . . , n, and B1| · · · |Bn. The set S generalizes the mixed-integer rounding (MIR) set of Nemhauser and Wolsey and the mixing-MIR set of Günlük and Pochet. In addition, it arises as a substructure in general mixed-integer programming (MIP), such as in lot-sizing. Despite its importance, a n...
متن کاملThe Mixing Set with Divisible Capacities
Given rational numbers C0, . . . , Cm and b0, . . . , bm, the mixing set with arbitrary capacities is the mixed-integer set defined by conditions s + Ctzt ≥ bt, 0 ≤ t ≤ m, s ≥ 0, zt integer, 0 ≤ t ≤ m. Such a set has applications in lot-sizing problems. We study the special case of divisible capacities, i.e. Ct/Ct−1 is a positive integer for 1 ≤ t ≤ m. Under this assumption, we give an extended...
متن کاملThe mixing set with divisible capacities: A simple approach
We give a simple algorithm for linear optimization over the mixing set with divisible capacities, and derive a compact extended formulation from such an algorithm. The main idea is to apply a suitable unimodular transformation to obtain an equivalent problem that is easier to analyze.
متن کاملMixing MIR inequalities with two divisible coefficients
This paper is a polyhedral study of a generalization of the mixing set where two different, divisible coefficients are allowed for the integral variables. Our results generalize earlier work on mixed integer rounding, mixing, and extensions. They also directly apply to applications such as production planning problems involving lower bounds or start-ups on production, when these are modeled as ...
متن کاملContinuous knapsack sets with divisible capacities Laurence
We study two continuous knapsack sets Y! and Y" with n integer, one unbounded continuous and m bounded continuous variables in either ! or " form. When the coefficients of the integer variables are integer and divisible, we show in both cases that the convex hull is the intersection of the bound constraints and 2m polyhedra arising from a continuous knapsack set with a single unbounded continuo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2007
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-007-0140-6